A fixed interval schedule in which the interval is initiated by a response
نویسندگان
چکیده
منابع مشابه
Tolerance to effects of cocaine on behavior under a response-initiated fixed-interval schedule.
Tolerance to effects of cocaine can be modulated by schedules of reinforcement. With multiple ratio schedules, research has shown an inverse relationship between ratio requirement and amount of tolerance that resulted from daily administration of the drug. In contrast, tolerance to the effects of cocaine on behavior under multiple interval schedules generally has developed regardless of interva...
متن کاملSchedule-induced polydipsia as a function of fixed interval length.
Rats were trained to bar-press for Noyes pellets on an FI schedule which was increased serially through several values from 2 sec to as high as 300 sec. Concurrently, water was freely available. As FI length was increased, the degree of polydipsia increased linearly to a maximum value.
متن کاملWhich Interval Is the Closest to a Given Set?
In some practical situations, we know a set of possible values of a physical quantity – a set which is not an interval. Since computing with sets is often complicated, it is desirable to approximate this set by an easier-to-process set: namely, with an interval. In this paper, we describe intervals which are the closest approximations to a given set. 1 Formulation of the Problem Why do we need ...
متن کاملUnit Interval Editing is Fixed-Parameter Tractable
Given a graph G and integers k1, k2, and k3, the unit interval editing problem asks whether G can be transformed into a unit interval graph by at most k1 vertex deletions, k2 edge deletions, and k3 edge additions. We give an algorithm solving this problem in time 2 logk) · (n+m), where k := k1 +k2 +k3, and n,m denote respectively the numbers of vertices and edges of G. Therefore, it is fixed-pa...
متن کاملInterval Completion Is Fixed Parameter Tractable
We present an algorithm with runtime O(knm) for the following NP-complete problem [9, problem GT35]: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open question [17, 7, 25, 14], first posed by Kaplan, Shamir and Tarjan, of whether this problem was fixed parameter tractable. The problem ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Experimental Analysis of Behavior
سال: 1963
ISSN: 0022-5002
DOI: 10.1901/jeab.1963.6-323